Heuristic for a Real-life Truck and Trailer Routing Problem
نویسندگان
چکیده
In this paper we suggest a multi-start greedy heuristic for a real-life truck and trailer routing problem. The considered problem is a site dependent heterogeneous fleet truck and trailer routing problem with soft and hard time windows and split deliveries. This problem arises in delivering goods from a warehouse to stores of a big retail company. There are about 400 stores and 100 vehicles for one warehouse. Our heuristic is based on sequential greedy insertion of a customer to a route with further improvement of the solution. The computational experiments are performed for real-life data. We also provide a mixed integer linear programming formulation for precise and clear description of the problem. © 2014 The Authors. Published by Elsevier B.V. Selection and/or peer-review under responsibility of the organizers of ITQM 2014
منابع مشابه
Heuristic with elements of tabu search for Truck and Trailer Routing Problem
Vehicle Routing Problem is a well-known problem in logistics and transportation, and the variety of such problems is explained by the fact that it occurs in many real-life situations. It is an NP-hard combinatorial optimization problem and finding an exact optimal solution is practically impossible. In this work, SiteDependent Truck and Trailer Routing Problem with hard and soft Time Windows an...
متن کاملA simulated annealing heuristic for the truck and trailer routing problem with time windows
In this study, we consider the application of a simulated annealing (SA) heuristic to the truck and trailer routing problem with time windows (TTRPTW), an extension of the truck and trailer routing problem (TTRP). TTRP is a variant of the well-known well-studied vehicle routing problem (VRP). In TTRP, some customers can be serviced by either a complete vehicle (that is, a truck pulling a traile...
متن کاملHeuristic for Site-Dependent Truck and Trailer Routing Problem with Soft and Hard Time Windows and Split Deliveries
In this paper we develop an iterative insertion heuristic for a site-dependent truck and trailer routing problem with soft and hard time windows and split deliveries. In the considered problem a truck can leave its trailer for unloading or parking, make a truck-subtour to serve truckcustomers, and return back to take the trailer. This can be done several times in one route. In our heuristic eve...
متن کاملHeuristic column generation for the truck and trailer routing problem ⋆
We present a heuristic column generation for the truck and trailer routing problem (TTRP) in which the routes of the local optima of a GRASP/VNS are used as columns of a set-partitioning formulation of the TTRP. This approach outperforms the previous state-of-the-art methods and improves the best-known solutions for several test instances from the literature.
متن کاملA note on the truck and trailer routing problem
This study considers a relaxation of the truck and trailer routing problem (TTRP), called the relaxed truck and trailer routing problem (RTTRP). In the TTRP, the number of available vehicles, namely trucks and trailers, is limited. Since there are no fixed costs associated with the trucks or trailers, it is reasonable to relax this fleet size constraint. Besides, most benchmark instances for th...
متن کامل